Formalization of Invariant Patterns for the Invariant Refinement Method
نویسندگان
چکیده
This report provides formalization of the Invariant Refinement Method. In particular, it formally describes the individual invariant patterns w.r.t. (soft) real-time constraints and provides formulation, as well as proofs of theorems related to refinement among these patterns. This work was partially supported by the Grant Agency of the Czech Republic project P202/11/0312. This work was also partially supported by the EU project ASCENS 257414. D3S, Technical Report no. D3S-TR-2013-04 CONTENTS
منابع مشابه
Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملRobust gain-scheduled control of linear parameter-varying systems with uncertain scheduling parameters in the presence of the time-invariant uncertainties
In this paper, a new approach is presented to design a gain-scheduled state-feedback controller for uncertain linear parameter-varying systems. It is supposed that the state-space matrices of them are the linear combination of the uncertain scheduling parameters. It is assumed that the existed uncertainties are of type of time-invariant parametric uncertainties with specified intervals. Simulta...
متن کاملAn Approach to Deriving Maximal Invariant Statistics
Invariance principles is one of the ways to summarize sample information and by these principles invariance or equivariance decision rules are used. In this paper, first, the methods for finding the maximal invariant function are introduced. As a new method, maximal invariant statistics are constructed using equivariant functions. Then, using several equivariant functions, the maximal invariant...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملDetection of Copy-Move Forgery in Digital Images Using Scale Invariant Feature Transform Algorithm and the Spearman Relationship
Increased popularity of digital media and image editing software has led to the spread of multimedia content forgery for various purposes. Undoubtedly, law and forensic medicine experts require trustworthy and non-forged images to enforce rights. Copy-move forgery is the most common type of manipulation of digital images. Copy-move forgery is used to hide an area of the image or to repeat a por...
متن کامل